Conditions for factorable relations
نویسندگان
چکیده
منابع مشابه
Arc consistency for factorable relations
An optimal arc consistency algorithm AC-4 was given by Mohr and Henderson [8]. AC4 has cost 0(ea), and cost (na) for scene labelling. Although their algorithm is indeed optimal, under certain conditions a constraint satisfaction problem can be transformed into a less complex problem. In this paper, we present conditions and mechanisms for such transformations, and show how to factor relations i...
متن کاملLower Bounds for Some Factorable Matrices
The following conjecture was posed by Axler and Shields. Let {xn} be a monotone decreasing sequence of nonnegative numbers, C the Cesáro matrix of order one. What is the best constant K for which ‖Cx‖2 ≥ K‖x‖2 for all such sequences {xn}? Lyons [3] determined that the best constant is π/ √ 6. This result was extended to p spaces for p > 1 by Bennett [1]. In [1], Bennett established the followin...
متن کاملFactorable Congruences and Strict Refinement
We show that universal algebras with factorable congruences such as rings with 1 and semirings with 0 and 1 enjoy some of the properties of universal algebras whose congruence lattices are distributive, such as the strict refinement property and a variant of Jónsson’s lemma. A universal algebra A is said to have factorable congruences if whenever A ∼= B × C and θ is a congruence on A, then θ = ...
متن کاملNecessary and sufficient conditions for inclusion relations for absolute summability
In this paper we obtain appropriate necessary and sufficient conditions for |N, pn|k summability to imply that of |N,qn|s for 1< k≤ s<∞. As in [6] we make use of a result of Bennett [1], who has obtained necessary and sufficient conditions for a factorable matrix to map lk → ls. A factorable matrix A is one in which each entry ank = bnck. Weighted mean matrices are factorable. It will not be po...
متن کاملStructure in Optimization: Factorable Programming and Functions
The purpose of this paper is to explore structures of functions in optimization. We will assume that the functions are composed of user-defined functions and are given as computer programs. Factorable functions and factorable programming problems were developed from 1967 through 1990 and are early examples of structure in nonlinear optimization. We explore the relationship between source code t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Czechoslovak Mathematical Journal
سال: 1991
ISSN: 0011-4642,1572-9141
DOI: 10.21136/cmj.1991.102442